A Multigrid Algorithm for the Mortar Finite Element Method

Analysis of a Multigrid Algorithm for the Mortar Finite Element Method

Analysis of a Multigrid Algorithm for Mortar Element Method

In this paper, a multigrid algorithm is studied for mortar element method for rotated Q1 element, the mortar condition is only dependent on the degrees of the freedom on subdomains interfaces. We prove the convergence of W-cycle multigrid and construct a variable V-cycle multigrid preconditioner which is available.

Multigrid Methods for Saddlepoint Problems Arising from Mortar Finite Element Discretizations

A multigrid algorithm for saddle point problems arising from mortar nite element discretizations is analyzed. Here, we do not require that the constraints at the interface are satissed in each smoothing step. Using mesh dependent norms for the Lagrange multiplier, suitable approximation and smoothing properties are established. A convergence rate independent of the meshsize is obtained for the ...

Multigrid for the Mortar Finite Element Method

A multigrid technique for uniformly preconditioning linear systems arising from a mortar finite element discretization of second order elliptic boundary value problems is described and analyzed. These problems are posed on domains partitioned into subdomains, each of which is independently triangulated in a multilevel fashion. The multilevel mortar finite element spaces based on such triangulat...

Stability Estimates of the Mortar Finite Element Method for 3-Dimensional Problems

This paper is concerned with the mortar finite element method for three spatial variables. The two main issues are the proof of the LBB condition based on appropriate choices of Lagrange multipliers and optimal efficiency of corresponding multigrid schemes for the whole coupled systems of equations. The implementation of the smoothing procedure also differs from that one used in the 2-dimension...